On Goodman Realizability

On Bus Graph Realizability

In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u, v) for some u ∈ V1 and v ∈ V2 is drawn as a lin...

Similarity After Goodman

In a famous critique, Goodman dismissed similarity as a slippery and both philosophically and scientifically useless notion. We revisit his critique in the light of important recent work on similarity in psychology and cognitive science. Specifically, we use Tversky's influential set-theoretic account of similarity as well as Gärdenfors's more recent resuscitation of the geometrical account to ...

Miriam B. Goodman

Miriam B. Goodman is an Associate Professor of Molecular and Cellular Physiology at Stanford University. Her lab is a collection of people with diverse training and a shared interest in understanding how sensation works. Her first exposure to scientific research was as a high school student in Bethesda, MD, when she wrote custom scientific software at NIH. After obtaining a Bachelor’s degree in...

Goodman, 'grue' and Hempel*

It is now commonly accepted that N. Goodman's predicate "grue" presents the theory of confirmation of C. G. Hempel (and other such theories) with grave difficulties. The precise nature and status of these "difficulties" has, however, never been made clear. In this paper it is argued that it is very unlikely that "grue" raises any formal difficulties for Hempel and appearances to the contrary ar...

On Forcing and Classical Realizability